Natural Deduction for Hybrid Logic
نویسنده
چکیده
In this paper we give a natural deduction formulation of hybrid logic. Our natural deduction system can be extended with additional inference rules corresponding to conditions on the accessibility relations expressed by so-called geometric theories. Thus, we give natural deduction systems in a uniform way for a wide class of hybrid logics which appears to be impossible in the context of ordinary modal logic. We prove soundness and completeness and we prove a normalization theorem. We finally prove a result which says that normal derivations in the natural deduction system correspond to derivations in a cut-free Gentzen system.
منابع مشابه
Natural Deduction for First-Order Hybrid Logic
This is a companion paper to [6] where a natural deduction system for propositional hybrid logic is given. In the present paper we generalize the system to the first-order case. Our natural deduction system for first-order hybrid logic can be extended with additional inference rules corresponding to conditions on the accessibility relations and the quantifier domains expressed by so-called geom...
متن کاملIntuitionistic hybrid logic
Hybrid logics are a principled generalization of both modal logics and description logics, a standard formalism for knowledge representation. In this paper we give the first constructive version of hybrid logic, thereby showing that it is possible to hybridize constructive modal logics. Alternative systems are discussed, but we fix on a reasonable and well-motivated version of intuitionistic hy...
متن کاملA Hilbert-Style Axiomatisation for Equational Hybrid Logic
This paper introduces an axiomatisation for equational hybrid logic based on previous axiomatizations and natural deduction systems for propositional and firstorder hybrid logic. Its soundness and completeness is discussed. This work is part of a broader research project on the development a general proof calculus for hybrid logics.
متن کاملInference Graphs: A New Kind of Hybrid Reasoning System
Hybrid reasoners combine multiple types of reasoning, usually subsumption and Prolog-style resolution. We outline a system which combines natural deduction and subsumption reasoning using Inference Graphs implementing a Logic of Arbitrary and Indefinite Objects.
متن کاملSynthetic completeness proofs for Seligman-style tableau systems
Hybrid logic is a form of modal logic which allows reference to worlds. We can think of it as ‘modal logic with labelling built into the object language’ and various forms of labelled deduction have played a central role in its proof theory. Jerry Seligman’s work [13,14] in which ‘rules involving labels’ are rejected in favour of ‘rules for all’ is an interesting exception to this. Seligman’s a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 14 شماره
صفحات -
تاریخ انتشار 2004